The Ring of Invariants of Three (3 × 3)-Matrices over a Field of Prime Characteristic

We find a minimal system of generators and a homogeneous system of parameters for the algebra of invariants of three matrices of third order over a field of an arbitrary characteristic.     

A remark on divisibility of definable groups

We show that if G is a definably compact, definably connected definable group defined in an arbitrary o‐minimal structure, then G is divisible. Furthermore, if G is defined in an o‐minimal expansion of a field, k ∈ ? and p_k : G → G is the definable map given by p_k (x ) = x^k for all x ∈ G , then we have |(p_k )^–1(x )| ≥ k^r for all x ∈ G , where r > 0 is the maximal dimension of abelian definable subgroups of G . (© 2005 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim)     

晶体学与准晶体学点群的母子群关系

依据群论，得出了准晶体学点群的直积或半直积推导算式；依据结晶学理论，绘出了五角、八角、十角和十二角晶系各点群的极赤投影图.据此推导出了每一个准晶体学点群的全部最大子群，从而推导并绘制出了三维晶体学和准晶体学点群之间的母子群关系(60个点群的“家谱”).该“家谱”以最大子群链的图解形式直观地给出了每个点群的最小母群和最大子群. 关键词： 准晶体 晶体 点群 最大子群 最小母群 群链     

从圆内接三角形面积想到的

首先证明了正三角形的外接椭圆中面积最小的是一个圆.进而用初等方法证明了二维情形的F.John定理.     

Approximation of Matrices and a Family of Gander Methods for Polar Decomposition

Two matrix approximation problems are considered: approximation of a rectangular complex matrix by subunitary matrices with respect to unitarily invariant norms and a minimal rank approximation with respect to the spectral norm. A characterization of a subunitary approximant of a square matrix with respect to the Schatten norms, given by Maher, is extended to the case of rectangular matrices and arbitrary unitarily invariant norms. Iterative methods, based on the family of Gander methods and on Higham’s scaled method for polar decomposition of a matrix, are proposed for computing subunitary and minimal rank approximants. Properties of Gander methods are investigated in details. AMS subject classification (2000) 65F30, 15A18     

矩阵多项式可逆的充要条件——兼与吴华安先生商榷

给出了矩阵多项式可逆的另一个充要条件,并指出文[1]中的错误.     

Cuccia定理的一个推广

For a finite group G,let S(G)be the set of minimal subgroups of odd order of G which are complemented in G.It is proved that if every minimal subgroup X of odd order of G which does not belong to S(G),C_G(X)is either subnormal or abnormal in G.Then G solvable.     

Locally minimal uniformly oriented shortest networks

The Steiner problem in a λ-plane is the problem of constructing a minimum length network interconnecting a given set of nodes (called terminals), with the constraint that all line segments in the network have slopes chosen from λ uniform orientations in the plane. This network is referred to as a minimum λ-tree. The problem is a generalization of the classical Euclidean and rectilinear Steiner tree problems, with important applications to VLSI wiring design.A λ-tree is said to be locally minimal if its length cannot be reduced by small perturbations of its Steiner points. In this paper we prove that a λ-tree is locally minimal if and only if the length of each path in the tree cannot be reduced under a special parallel perturbation on paths known as a shift. This proves a conjecture on necessary and sufficient conditions for locally minimal λ-trees raised in [M. Brazil, D.A. Thomas, J.F. Weng, Forbidden subpaths for Steiner minimum networks in uniform orientation metrics, Networks 39 (2002) 186-222]. For any path P in a λ-tree T, we then find a simple condition, based on the sum of all angles on one side of P, to determine whether a shift on P reduces, preserves, or increases the length of T. This result improves on our previous forbidden paths results in [M. Brazil, D.A. Thomas, J.F. Weng, Forbidden subpaths for Steiner minimum networks in uniform orientation metrics, Networks 39 (2002) 186-222].     

A Theta Lift for Spin7

We establish an example of a functorial lift from generic cuspidal representations of a similitude group of the type A ₁×C ₂ to generic representations of Spin₇. Our construction uses the theta correspondence associated to the dual pair of the type (A ₁×C ₂ B ₃) inside E ₇. We also consider another theta correspondence associated to the dual pair of type (A ₁×C ₂ A ₁×A ₁) in D ₆ and show that these two pairs fit into a tower and the standard properties of a tower of theta correspondences hold.     

Minimal rambling sets with codimension one dominated splittings

In this paper,we study the dynamics of minimal rambling sets with codimension one dominatedsplittings